Distributed Asynchronous Automata
نویسنده
چکیده
Asynchronous automata are a model of communication processes with a distributed control structure, global initializations and global accepting conditions. The well-known theorem of Zielonka states that they recognize exactly the class of regular Mazurkiewicz trace languages. In this paper we study the particular case of distributed asynchronous automata, which require that the initializations and the accepting conditions are distributed as well: every process chooses an initial local state and stops in a final local state independently from each other. We characterize effectively the regular trace languages recognized by these automata. Also, we present an original algorithm to build, if it is possible, a non-deterministic distributed asynchronous automaton that recognizes a given regular trace language. Surprisingly, this algorithm yields a new construction for the more general problem of the synthesis of asynchronous automata from regular trace languages that subsumes all existing ones in terms of space complexity.
منابع مشابه
Generalized Asynchronous Systems
The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asyn-chronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns tim...
متن کاملDistributed Time-Asynchronous Automata
We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its relat...
متن کاملSynthesis of Distributed Algorithms Using Asynchronous Automata
We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework. Theorems by Zielonka and Morin are then used to develop and implement a synthesis algorithm. Finally, we apply the developed...
متن کاملA temporal logic for the specification and verification of distributed behaviour
In this work we develop a temporal logic with fixpoints for distributed processes or distributed systems. Standard temporal logics refer to sequential processes (execution sequences) of distributed systems. Expressive temporal operators such as “Until” can be expressed as fixpoints of formulae involving only the simple “Next” modality. Fixpoint logics for sequential processes are known to be ex...
متن کاملAutomata on Distributed Alphabets
Traditional automata theory is an extremely useful abstraction for reasoning about sequential computing devices. For distributed systems, however, there is no clear consensus on how best to incorporate various features such as spatial independence, concurrency and communication into a formal computational model. One appealing and elegant approach is to have a network of automata operating on a ...
متن کامل